Recursive algorithms for phylogenetic tree counting
نویسندگان
چکیده
منابع مشابه
Algorithms for Phylogenetic Tree Reconstruction
Scientists often wish to use the information contained in the DNA sequences of a collection of organisms, or taxa, to infer the evolutionary relationships among those taxa. These evolutionary relationships are generally represented by a labeled binary tree, called a phylogenetic tree. The phylogeny reconstruction problem is computationally di cult because the number of possible solutions increa...
متن کاملAlgorithms for efficient phylogenetic tree construction
The gene-duplication problem is to infer a species supertree from a collection of gene trees that are confounded by complex histories of gene duplications. This problem is NP-hard and thus requires efficient and effective heuristics. Existing heuristics perform a stepwise search of the tree space, where each step is guided by an exact solution to an instance of a local search problem. These loc...
متن کاملPhylogenetic tree constructing algorithms fit for grid computing with SVD
Erikkson showed that singular value decomposition(SVD) of flattenings determined a partition of a phylogenetic tree to be a split. In this paper, based on his work, we develop new statistically consistent algorithms fit for grid computing to construct a phylogenetic tree by computing SVD of flattenings with the small fixed number of rows.
متن کاملOn the Recursive Depth of Special Tree Traversal Algorithms
In this paper we are concerned with the analysis of special recursive algorithms for traversing the nodes of a planted plane tree (ordered tree ; planar tree) . Some by now classical results in this area are due to (de Bruijn, Knuth, and Rice, 1972 ; Knuth, 1973 ; Flajolet, 1981 ; Flajolet and Odlyzko, 1982 ; Flajolet, Raoult, and Vuillemin, 1979 ; Kemp, 1979) and others and are summarized in t...
متن کاملParallelization of Tree-Recursive Algorithms on a SIMD Machine
The set of tree-recursive algorithms is large, including constraint satisfaction using backtracking, iterative-deepening search such as IDA*, depth-first branch-and-bound, twoplayer game minimax search, and many divide-and-conquer algorithms. We describe a structured method for implementing such algorithms on SIMD machines, and identify measures for determining if a tree-recursive application i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms for Molecular Biology
سال: 2013
ISSN: 1748-7188
DOI: 10.1186/1748-7188-8-26